Exp-Uniform Distribution: Properties and Characterizations

Exp-Kumaraswamy Distributions: Some Properties and Applications

In this paper, we propose and study exp-kumaraswamy distribution. Some of its properties  are derived, including the density function, hazard rate function, quantile function, moments,  skewness  and kurtosis.   Adata set isused to illustrate an application of the proposed distribution. Also, we obtain a new distribution by transformation onexp-kumaraswamy distribution.   New distribution is an...

Uniform Characterizations of Non-Uniform Complexity Measures

Non-uniform complexity measures originated in automata and formal languages theory are characterized in terms of well-known uniform complexity classes. The initial index of languages is introduced by means of several computational models. It is shown to be closely related to context-free cost, boolean circuits, straight line programs, and Turing machines with sparse oracles and time or space bo...

The Uniform-Pareto Distribution and Eeponentiated Uniform-Pareto Distribution and Their Application in Income Data

‎In this paper‎, ‎a new distribution is introduced‎, ‎which is a generalization of a well-known distribution‎. ‎This distribution is flexible and applies to income data modeling‎. ‎We first provide some of the mathematical and distributional properties of this new model and then‎, ‎to demonstrate the flexibility the new distribution‎, ‎we will present the applications of this distribution with ...

Asymmetric Uniform-Laplace Distribution‎: ‎Properties and Applications

‎The goal of this study is to introduce an Asymmetric Uniform-Laplace (AUL) distribution‎. ‎We present a detailed theoretical description of this distribution‎. ‎We try to estimate the parameters of AUL distribution using the maximum likelihood method‎. ‎Since the likelihood approach results in complicated forms‎, ‎we suggest a bootstrap-based approach for es...

Uniform Characterizations of Polynomial-Query Learnabilities

We consider the exact learning in the query model. We deal with all types of queries introduced by Angluin: membership, equivalence, superset, subset, disjointness and exhaustiveness queries, and their weak (or restricted) versions where no counterexample is returned. For each of all possible combinations of these queries, we uniformly give complete characterizations of boolean concept classes ...

Characterizations of stack uniform strict deterministic languages